Computations and Some Open Problems

نویسنده

  • William Sit
چکیده

I’ll discuss some open problems related to differential algebra for which experiments in computations may be helpful. Examples showing how to set up such experiments will be given. There are two obvious points I want to make: 1. Computations become necessary when we want to compute something, like solving a system of (differential) equations, or finding some examples or counterexamples. 2. In turns, computational consideration of effectiveness and efficiency may itself lead to mathematical problems, such as complexity, enumeration of vector space basis, encoding of input and output, etc. Some of these problems are of interest in its own right. Advice: You can write a dissertation or paper on the new problems if you cannot solve the original computation problem!

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On some open problems in cone metric space over Banach algebra

In this paper we prove an analogue of Banach and Kannan fixed point theorems by generalizing the Lipschitz constat $k$, in generalized Lipschitz mapping on cone metric space over Banach algebra, which are answers for the open problems proposed by Sastry et al, [K. P. R. Sastry, G. A. Naidu, T. Bakeshie, Fixed point theorems in cone metric spaces with Banach algebra cones, Int. J. of Math. Sci. ...

متن کامل

Shape Optimization Problems for Eigenvalues of Elliptic Operators

We consider a general formulation for shape optimization problems involving the eigenvalues of the Laplace operator. Both the cases of Dirichlet and Neumann conditions on the free boundary are studied. We survey the most recent results concerning the existence of optimal domains, and list some conjectures and open problems. Some open problems are supported by efficient numerical computations.

متن کامل

UNBOUNDEDNESS IN MOILP AND ITS EFFICIENT SOLUTIONS

In this paper we investigate Multi-Objective Integer Linear Programming (MOILP) problems with unbounded feasible region and introduce recession direction for MOILP problems. Then we present necessary and sufficient conditions to have unbounded feasible region and infinite optimal values for objective functions of MOILP problems. Finally we present some examples with unbounded feasible region and fi...

متن کامل

‎A Consistent and Accurate Numerical Method for Approximate Numerical Solution of Two Point Boundary Value Problems

In this article we have proposed an accurate finite difference method for approximate numerical solution of second order boundary value problem with Dirichlet boundary conditions. There are numerous numerical methods for solving these boundary value problems. Some these methods are more efficient and accurate than others with some advantages and disadvantages. The results in experiment on model...

متن کامل

An electromagnetism-like metaheuristic for open-shop problems with no buffer

This paper considers open-shop scheduling with no intermediate buffer to minimize total tardiness. This problem occurs in many production settings, in the plastic molding, chemical, and food processing industries. The paper mathematically formulates the problem by a mixed integer linear program. The problem can be optimally solved by the model. The paper also develops a novel metaheuristic base...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006